primal algorithm

алгоритм решения прямой задачи

English-Russian dictionary of computer science. 2015.

Смотреть что такое "primal algorithm" в других словарях:

  • Primal-Dual-Active-Set-Algorithmus — Der Primal Dual Active Set Algorithmus ist ein Verfahren zur Lösung eines quadratischen Optimierungsproblems über einer konvexen Teilmenge S eines Hilbertraumes V über der Menge Ω. Inhaltsverzeichnis 1 Das Problem 2 Der Algorithmus …   Deutsch Wikipedia

  • Primal-Dual-Active-Set Algorithmus — Der Primal Dual Active Set Algorithmus ist ein Verfahren zur Lösung eines quadratischen Optimierungsproblems über einer konvexen Teilmenge S eines Hilbertraumes V über der Menge Ω. Inhaltsverzeichnis 1 Das Problem 2 Der Algorithmus 3 Anwendungen …   Deutsch Wikipedia

  • Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… …   Wikipedia

  • Hungarian algorithm — The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal dual methods. It was developed and published by Harold Kuhn in 1955, who gave the name… …   Wikipedia

  • Hybrid algorithm (constraint satisfaction) — In constraint satisfaction, a hybrid algorithm solves a constraint satisfaction problem by the combination of two different methods, for example variable conditioning (backtracking, backjumping, etc.) and constraint inference (arc consistency,… …   Wikipedia

  • Frank–Wolfe algorithm — The Frank–Wolfe algorithm, also known as the convex combination algorithm , is a classic algorithm in operations research (OR). It was originally proposed by Marguerite Frank and Phil Wolfe in 1956 as a procedure for solving quadratic programming …   Wikipedia

  • Isotonic regression — In numerical analysis, isotonic regression (IR) involves finding a weighted least squares fit to a vector with weights vector subject to a set of monotonicity constraints giving a simple or partial order over the variables. The monotonicity… …   Wikipedia

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Decomposition method (constraint satisfaction) — In constraint satisfaction, a decomposition method translates a constraint satisfaction problem into another constraint satisfaction problem that is binary and acyclic. Decomposition methods work by grouping variables into sets, and solving a… …   Wikipedia

  • Blob detection — Feature detection Output of a typical corner detection algorithm …   Wikipedia

  • Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …   Wikipedia

Книги

Другие книги по запросу «primal algorithm» >>

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.